搜索资源列表
binary-tree
- 二叉树建立、插入删除基本演示，数据结构课设-binary tree
Binary-tree
- 二叉树，可以进行二叉树的建立和查找，对二叉树进行操作，实现二叉树的数据结构-Binary tree, binary tree can be set up and find, to operate on the binary tree, binary tree data structure to achieve
Binary-tree-traversal-algorithm
- 二叉树的遍历有常用的三种方法，分别是：先根次序、中根次序、后根次序。为了验证这几种遍历算法的区别，本次的实验将会实现所有的算法。 遍历的时候，把结点的信息打印出来，为了让结点的信息更容易区别，在每个结点前加上数字标识。如：data[1]=A,data[2]=B. 实现的算法皆为递归算法 -Binary tree traversal has used three methods, namely: first, the root sequence, the order of the ro
Binary-tree-traversal-structure
- 二叉树非递归遍历的源代码 数据结构实验 C语言编程-Binary tree traversal non-recursive data structure of the source code in C programming experiments
binary-tree
- 返回二叉树的根+返回树中某个结点的左孩子，若无则返回空+返回树中某个结点的双亲，如果是根结点，则返回空-Returns the binary tree root+ returns tree in a node of the left child, if there is no return null+ returns tree in a node s parents, if the root node, it returns null
binary-tree
- 二叉树的实现，包括深度和广度遍历等基本功能-Binary tree implementations, including traversing the depth and breadth of the basic functions
binary-tree
- 二叉树头文件操作，可以进行相关查找，删除-binary tree
binary-tree
- 二叉树,编写程序任意输入二叉树的结点个数和结点值，构造一棵二叉树，采用三种递归遍历算法(前序、中序、后序)对这棵二叉树进行遍历并计算出二叉树的高度。-binary tree
N-binary-tree-to-traverse
- 本程序用递归法遍历N叉树。可进行深度和广度遍历。 注： 按“/”键结束输入 如 2 1 3 / 6 / 9 / / / / 输入可得 深度遍历为21369，广度遍历为21369 最打节点个数为100个，且节点类型为字符型-This program using a recursive method to traverse N binary tree. For depth and the breadth traverse.
binary-tree
- 非常不错的二叉树先序非递归建立程序，算法很强大，功能很全，说明也很详细。-a very good program for binary tree. the algorithm is very strong,and functions is all.
Binary-tree-to-traverse-the-code
- 二叉树操作源代码（建立，删除，添加，遍历等）-Binary tree to traverse the code
Binary-tree
- 二叉树的构造以及前序遍历，中序遍历等各种遍历算法-Binary tree structure as well as pre-order traversal, inorder traversal Binary And other traversal algorithm
Create-binary-tree
- 如何在C环境中建立经典的二叉树递归算法。-How to create recursive establishment of a binary tree in C.
Binary-tree
- 二叉树的各种算法，包括二叉树的创建，插入，删除，求深度等-A variety of binary tree algorithm, including the creation of a binary tree, insert, delete, and depth，and so on
Binary-Tree
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
Binary-Tree(new)
- 源代码实现了二叉树的遍历以及输出。直接可以运行，代码完整。-Binary Tree
binary-tree
- 吴及老师数据结构基础课件，数与二叉树部分-Wu and teacher data structures courseware, and the number of binary tree part
binary-tree
- 数据结构 二叉树的操作，可以对二叉树进行最基本的操作，先建立二叉树。-The operation of the binary tree, binary tree with the most basic operation, first create a binary tree.
Binary-tree-traversal
- 二叉树遍历：构建一个二叉树，输出结点信息，二叉树前序遍历，中序遍历，后续遍历，层次遍历。-Binary Tree Traversal: build a binary tree, the output node information before, binary tree traversal in preorder traversal, the follow-up traverse the hierarchy traversal.
Classification-of-binary-tree
- 利用分类二叉树查找及堆排序实现学生成绩管理 -Classification of binary tree search and sort heap of student achievement management